Clustering Player Paths

نویسندگان

  • Jonathan C. Campbell
  • Jonathan Tremblay
  • Clark Verbrugge
چکیده

Player traces can result in a vast amount of high-dimensional data. This information is crucial to game designers trying to understand player behaviour and for tailoring the game experience. In this work we investigate different approaches to clustering player traces in order to expose useful game information. We consider three trace similarity metrics, as well as two clustering algorithms. We evaluate and compare the different approaches using trivial and non-trivial game levels from different game genres, giving guidance on clustering and metric choices, and illustrating the potential value of cluster information.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Ant-Colony Optimization Clustering Model for Cellular Automata Routing in Wireless Sensor Networks

High efficient routing is an important issue for the design of wireless sensor network (WSN) protocols to meet the severe hardware and resource constraints. This paper presents an inclusive evolutionary reinforcement method. The proposed approach is a combination of Cellular Automata (CA) and Ant Colony Optimization (ACO) techniques in order to create collision-free trajectories for every agent...

متن کامل

The Robustness of Extortion in Iterated Prisoner’s Dilemma∗

Press and Dyson (2012) discovered a special set of strategies, called extortionate strategies, in the two-player Iterated Prisoner’s Dilemma. Surprisingly, a player using such strategies obtains an advantageous share of the total payoff score of the players. The other player maximizes his own score by fully cooperating, and when doing so he maximizes the score of the extortioner as well. When a...

متن کامل

The robustness of zero-determinant strategies in Iterated Prisoner's Dilemma games.

Press and Dyson (2012) discovered a special set of strategies in two-player Iterated Prisoner's Dilemma games, the zero-determinant (ZD) strategies. Surprisingly, a player using such strategies can unilaterally enforce a linear relation between the payoffs of the two players. In particular, with a subclass of such strategies, the extortionate strategies, the former player obtains an advantageou...

متن کامل

مکانیابی خطاهای پنهان نرم افزار با استفاده از آنتروپی متقاطع و مدلهای n-گرام

The aim is to automate the process of bug localization in program source code. The cause of program failure could be best determined by comparing and analyzing correct and incorrect execution paths generated by running the instrumented program with different failing and passing test cases. To compare and analysis the execution paths, one approach is clustering the paths according to their simil...

متن کامل

Familiarising Probabilistic Distance Clustering System of Evolving Awale Player

This study developed a new technique based on Probabilistic Distance Clustering (PDC) for evolving Awale player and to compare its performance with that of a technique based on approximation of minimum and maximum operators with generalized mean-value operator. The basic theory of pd-clustering is based on the assumption that the probability of an Euclidean point belonging to a cluster is inver...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015